#include"RBTree.h"

int main()
{
	RBTree<int, int> t;
	int a[] = { 17, 18, 23, 34, 27, 15, 9, 6, 8, 5, 25 };
	for (auto e : a)
	{
		cout << e << endl;
		t.Insert({ e, e });
	}
	t.Inorder();
	t.Preorder();
	cout << t.IsRBTree() << endl;
	RBTree<int, int> t2(t);
	cout << t.IsRBTree() << endl;
	return 0;
}